Snap-stabilization in message-passing systems

Brief Annoucement: Snap-Stabilization in Message-Passing Systems

In this announcement, we report recent results where we address the open problem of snap-stabilization in messagepassing systems. (A full version of this paper is available as [3] at http://arxiv.org/abs/0802.1123.)

Snap-Stabilization in Message-Passing Systems Brief Announcement

In this announcement, we report recent results [4] (available at http://arxiv.org/abs/0802. 1123) where we address the open problem of snap-stabilization in message-passing systems. The concept of snap-stabilization [3] offers an attractive approach to transient fault tolerance. As soon as such fault ends a snap-stabilizing protocol immediately operates correctly. Of course, not all safety pred...

Pragmatic Self-stabilization of Atomic Memory in Message-Passing Systems

A fault-tolerant and stabilizing simulation of an atomic register is presented. The simulation works in asynchronous message-passing systems, and allows a minority of processes to crash. The simulation stabilizes in a pragmatic manner, by reaching a long execution in which it runs correctly. A key element in the simulation is a new combinatorial construction of a bounded labeling scheme accommo...

Gossiping in Message-Passing Systems

We study the gossip problem in a message-passing environment: When a process receives a message, it has to decide whether the sender has more recent information on other processes than itself. This problem is at the heart of many distributed algorithms, and it is tightly related to questions from formal methods concerning the expressive power of distributed automata. We provide a non-determinis...

Failure Detection in Message Passing Systems